Hereditarily-finite sets, data bases and polynomial-time computability
نویسندگان
چکیده
منابع مشابه
The Hereditarily Finite Sets
The theory of hereditarily finite sets is formalised, following the development of Świerczkowski [2]. An HF set is a finite collection of other HF sets; they enjoy an induction principle and satisfy all the axioms of ZF set theory apart from the axiom of infinity, which is negated. All constructions that are possible in ZF set theory (Cartesian products, disjoint sums, natural numbers, function...
متن کاملHereditarily Finite Sets in Constructive Type Theory
We axiomatize hereditarily finite sets in constructive type theory and show that all models of the axiomatization are isomorphic. The axiomatization takes the empty set and adjunction as primitives and comes with a strong induction principle. Based on the axiomatization, we construct the set operations of ZF and develop the basic theory of finite ordinals and cardinality. We construct a model o...
متن کاملA Formalisation of Finite Automata Using Hereditarily Finite Sets
Hereditarily finite (HF) set theory provides a standard universe of sets, but with no infinite sets. Its utility is demonstrated through a formalisation of the theory of regular languages and finite automata, including the Myhill-Nerode theorem and Brzozowski’s minimisation algorithm. The states of an automaton are HF sets, possibly constructed by product, sum, powerset and similar operations.
متن کاملOn function spaces and polynomial-time computability
In Computable Analysis, elements of uncountable spaces, such as the real line R, are represented by functions on strings and fed to Turing machines as oracles; or equivalently, they are represented by infinite strings and written on the tapes of Turing machines [Wei00, BHW08]. To obtain reasonable notions of computability and complexity, it is hence important to choose the “right” representatio...
متن کاملMathematical Logic A hierarchy of hereditarily finite sets
This article defines a hierarchy on the hereditarily finite sets which reflects the way sets are built up from the empty set by repeated adjunction, the addition to an already existing set of a single new element drawn from the already existing sets. The structure of the lowest levels of this hierarchy is examined, and some results are obtained about the cardinalities of levels of the hierarchy.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90345-t